Bit Commitment, Oblivious Transfer, and Mental Poker without One-way Functions
نویسندگان
چکیده
While it is fairly obvious that a secure (bit) commitment between two parties is impossible without a one-way function, we show that it is possible if the number of parties is at least 3. Then we show how our unconditionally secure (bit) commitment scheme for 3 parties can be used to arrange an unconditionally secure (bit) commitment between just two parties if they use a “dummy” (e.g., a computer) as the third party. We explain how our concept of a “dummy” is different from a well-known concept of a “trusted third party”. Based on a similar idea, we also offer an unconditionally secure k-n oblivious transfer protocol between two parties who
منابع مشابه
Secure verifiable non-interactive oblivious transfer protocol using RSA and Bit commitment on distributed environment
In this paper, we have discussed the issues concerning the basic concept and classification of OT (Oblivious Transfer). We have proposed secure verifiable non-interactive oblivious transfer protocols for the exchange of secrets on distributed environments. One is a new secure verifiable noninteractive oblivious transfer protocol using RSA, the other is that with bit commitment using one-way fun...
متن کاملAn Efficient Secure Oblivious Transfer
As traditional oblivious transfer protocols are treated as a cryptographic primitive, they are usually executed without the consideration of possible attacks, e.g., impersonation, replaying, and man-in-the-middle attacks. Therefore, when these protocols are applied in certain applications such as mental poker playing, some necessary mechanism must be executed first to ensure the security of sub...
متن کاملSecrecy without one-way functions
We show that some problems in information security can be solved without using one-way functions. The latter are usually regarded as a central concept of cryptography, but the very existence of one-way functions depends on difficult conjectures in complexity theory, most notably on the notorious “P 6= NP” conjecture. This is why cryptographic primitives that do not employ one-way functions are ...
متن کاملOn the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function
We show that non-interactive statistically-secret bit commitment cannot be constructed from arbitrary black-box one-to-one trapdoor functions and thus from general public-key cryptosystems. Reducing the problems of non-interactive crypto-computing, rerandomizable encryption, and non-interactive statistically-sender-private oblivious transfer and low-communication private information retrieval t...
متن کاملCommitted Oblivious Transfer and Private Multi-Party Computation
In this paper we present an eecient protocol for \Commit-ted Oblivious Transfer" to perform oblivious transfer on committed bits: suppose Alice is committed to bits a0 and a1 and Bob is committed to b, they both want Bob to learn and commit to a b without Alice learning b nor Bob learning a b. Our protocol, based on the properties of error correcting codes, uses Bit Commitment (bc) and one-out-...
متن کامل